MacMahon Symmetric Functions, the Partition Lattice, and Young Subgroups

نویسنده

  • Mercedes H. Rosas
چکیده

A MacMahon symmetric function is a formal power series in a finite number of alphabets that is invariant under the diagonal action of the symmetric group. In this article, we show that the MacMahon symmetric functions are the generating functions for the orbits of sets of functions indexed by partitions under the diagonal action of a Young subgroup of a symmetric group. We define a MacMahon chromatic symmetric function that generalizes Stanley's chromatic symmetric function. Then, we study some of the properties of this new function through its connection with the noncommutative chromatic symmetric function of Gebhard and Sagan. 2001 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary Proofs of Identities for Schur Functions and Plane Partitions

By a plane partition, we mean a finite set, P , of lattice points with positive integer coefficients, {(i, j, k)} ⊆ N, with the property that if (r, s, t) ∈ P and 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t, then (i, j, k) must also be in P . A plane partition is symmetric if (i, j, k) ∈ P if and only if (j, i, k) ∈ P . The height of stack (i, j) is the largest value of k for which there exists a point (i,...

متن کامل

Identities for Schur Functions and Plane Partitions

By a plane partition, we mean a finite set, P , of lattice points with positive integer coefficients, {(i, j, k)} ⊆ N, with the property that if (r, s, t) ∈ P and 1 ≤ i ≤ r, 1 ≤ j ≤ s, 1 ≤ k ≤ t, then (i, j, k) must also be in P . A plane partition is symmetric if (i, j, k) ∈ P if and only if (j, i, k) ∈ P . The height of stack (i, j) is the largest value of k for which there exists a point (i,...

متن کامل

THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary

A theory of counting nonintersecting lattice paths by the major index and generalizations of it is developed. We obtain determinantal expressions for the corresponding generating functions for families of nonintersecting lattice paths with given starting points and given final points, where the starting points lie on a line parallel to x+y = 0. In some cases these determinants can be evaluated ...

متن کامل

Sequences of Symmetric Polynomials and Combinatorial Properties of Tableaux

In 1977 G.P. Thomas has shown that the sequence of Schur polynomials associated to a partition can be comfortabely generated from the sequence of variables x = (x1; x2; x3; : : :) by the application of a mixed shift/multiplication operator, which in turn can be easily computed from the set SY T () of standard Young tableaux of shape. We generalise this construction, thereby making possible | fo...

متن کامل

Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables

We show that the Grothendieck bialgebra of the semi-tower of partition lattice algebras is isomorphic to the graded dual of the bialgebra of symmetric functions in noncommutative variables. In particular this isomorphism singles out a canonical new basis of the symmetric functions in noncommutative variables which would be an analogue of the Schur function basis for this bialgebra.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 96  شماره 

صفحات  -

تاریخ انتشار 2001